DELAUNAY TRIANGULATIONS OF EXTRA - LARGE METRICS 3 Proof
نویسنده
چکیده
In this note we study extra large spherical conemanifolds in dimension 2 (though many of our resultsz and techniques extend to higher dimensions. A 2-dimensional spherical cone manifold is a metric space where all but finitely many points has a neighborhood isometric to a neighborhood of a point on the round sphere S. The exceptional points (cone points) have neighboroods isometric to a spherical cone, the angle of which is the cone angle at that point. If M is a cone manifold, we define a geodesic to be a locally length minimizing curve onM. It is easy to see that such a curve is locally a great circle, except at the cone points. There, the geodesic must have the property that it subtends an angle no smaller than π on either side. Consequently, no geodesics can pass through cone points, where the cone angles are smaller than 2π (such cone points are known as positively curved cone points, since the curvature of a cone point is defined as 2π less the cone angle at the point). We say that a spherical cone manifold is extra large if
منابع مشابه
On the Number of Higher Order Delaunay Triangulations
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optimized. A triangulation is order-k Delaunay if the circumcircle of each triangle of the triangulation contains at most k points. In this paper we study lower and upper bounds on the number of higher order Delaunay trian...
متن کاملRandom Delaunay Triangulations and Metric Uniformization
The primary goal of this paper is to develop a new connection between the discrete conformal geometry problem of disk pattern construction and the continuous conformal geometry problem of metric uniformization. In a nutshell, we discuss how to construct disk patterns by optimizing an objective function, which turns out to be intimately related to hyperbolic volume. With the use of random Delaun...
متن کاملOuterplanar graphs and Delaunay triangulations
Over 20 years ago, Dillencourt [1] showed that all outerplanar graphs can be realized as Delaunay triangulations of points in convex position. His proof is elementary, constructive and leads to a simple algorithm for obtaining a concrete Delaunay realization. In this note, we provide two new, alternate, also quite elementary proofs.
متن کاملTowards a Definition of Higher Order Constrained Delaunay Triangulations
When a triangulation of a set of points and edges is required, the constrained Delaunay triangulation is often the preferred choice because of its well-shaped triangles. However, in applications like terrain modeling, it is sometimes necessary to have flexibility to optimize some other aspect of the triangulation, while still having nicely-shaped triangles and including a set of constraints. Hi...
متن کاملGeneral-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of user-specified domains, they have “nicely shaped” triangles that optimize several criteria, and they are easy to construct and update. The present work generalizes constrained Delaunay triangulations (CDTs) to higher dimensions, a...
متن کامل